A 2 out of 3 Visual Multiple Secret Sharing Method using Generalized Random Grids
نویسنده
چکیده
Visual secret sharing by using generalized random grids is a novel approach for generating nonexpansible shares by artfully utilizing various random variables. Stacking the shares together, secret image can be revealed. This paper proposes a 2 out of 3 visual multiple secret sharing method using generalized random grids. Three secret images (A, B, C) are used for generating three non-expansible shares (U, V, W). The secret revealing process is a kind of circle-style decoding: stacking U and V together, A can be revealed; stacking U and W together, B can be revealed; stacking V and W together, C can be revealed. The quality of stacking results can be adjusted by users for various applications.
منابع مشابه
Multiple Image Encryption using Random Circular Grids and Recursive Image Hiding
The visual secret sharing (VSS) scheme encrypts the secret information into various meaningless shares. These shares are distributed to the authorized participants and the secret information can be retrieved by any k out of n participants by stacking their respective shares on top of each other. This scheme uses HVS (Human Visual System) to decrypt the information, and thus no technical or fina...
متن کاملVisual Cryptography by Random Grids with Identifiable Shares
This paper proposes a visual cryptography by random grids scheme with identifiable shares. The method encodes an image O in two shares that exhibits the following features: (1) each generated share has the same scale as O, (2) any share singly has noise-like appearance that reveals no secret information on O, (3) the secrets can be revealed by superimposing the two shares, (4) folding a share u...
متن کاملA Study on Various Authentication methods of Random Grid Based Visual Secret Sharing with Improved Visual Quality
Visual secret sharing scheme (VSS) based on the concept to random grid (RG), suffers from the low visual quality of the decrypted secret. In this work a (2,n) RG based VSS has been proposed to improve the contrast. The proposed scheme supports the traditional stacking decryption method. To improve the visual quality further a decryption algorithm is proposed. The experimental result and compari...
متن کاملImproving Contrast in Random Grids Based Visual Secret Sharing
In the existing random grids based (n, n) visual secret sharing (VSS) schemes, decryption is done with the help of human visual system by stacking the cipher grids. The stacking operation is computationally modeled as Boolean OR operation, which suffers from two drawbacks. Firstly, the contrast of the reconstructed image decreases exponentially by increasing n (≥2) and secondly, it requires per...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کامل